An Adaptation of Proof-Planning to Declarer Play in Bridge

نویسندگان

  • Ian Frank
  • David A. Basin
  • Alan Bundy
چکیده

We present Finesse, a system that forms optimal plans for declarer play in the game of Bridge. Finesse generalises the technique of proof-planning, developed at Edinburgh University in the context of mathematical theorem-proving, to deal with the dis-junctive choice encountered when planning under uncertainty , and the context-dependency of actions produced by the presence of an opposition. In its domain of planning for individual suits, it correctly identiied the proper lines of play found in many examples from the Bridge literature, supporting its decisions with probabilistic and qualitative information. Cases were even discovered in which Finesse revealed errors in the analyses presented by recognised authorities.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Adaptation of Proof - Planning to Declarer

We present Finesse, a system that forms plans for declarer play in the game of Bridge. Finesse generalises the technique of proof-planning, developed at Edinburgh University in the context of mathematical theorem-proving, to deal with the dis-junctive choice encountered when planning under uncertainty , and the context-dependency of actions produced by the presence of an opposition. In its doma...

متن کامل

Computer Bridge - A Big Win for AI Planning

niques is now the world champion computer program in the game of Contract Bridge. As reported in The New York Times and The Washington Post, this program—a new version of Great Game Products’ BRIDGE BARON program—won the Baron Barclay World Bridge Computer Challenge, an international competition hosted in July 1997 by the American Contract Bridge League. It is well known that the game tree sear...

متن کامل

A Planning Approach to Declarer Play

Although game-tree search works well in perfect-information games, it is less suitable for imperfect-information games such as contract bridge. The lack of knowledge about the opponents' possible moves gives the game tree a very large branching factor, making it impossible to search a signiicant portion of this tree in a reasonable amount of time. This paper describes our approach for overcomin...

متن کامل

A Planning Approach to Declarer Play in Contract Bridge

Although game-tree search works well in perfect-information games, it is less suitable for imperfect-information games such as contract bridge. The lack of knowledge about the opponents' possible moves gives the game tree a very large branching factor, making it impossible to search a signiicant portion of this tree in a reasonable amount of time. This paper describes our approach for overcomin...

متن کامل

Success in Spades: Using AI Planning Techniques to Win the World Championship of Computer Bridge

The latest world-championship competition for computer bridge programs was the Baron Barclay World Bridge Computer Challenge, hosted in July 1997 by the American Contract Bridge League. As reported in The New York Times and The Washington Post, the competition’s winner was a new version of Great Game Products’ Bridge Baron program. This version, Bridge Baron 8, has since gone on the market; and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992